Low delay burst erasure correction codes

A Modification Method for Constructing Low-Density Parity-Check Codes for Burst Erasures

We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...

Burst Correction Coding From Low-Density Parity-Check Codes

BURST CORRECTION CODING FROM LOW-DENSITY PARITY-CHECK CODES Wai Han Fong, PhD George Mason University, 2015 Dissertation Director: Dr. Shih-Chun Chang Dissertation Co-Director: Dr. Shu Lin This thesis explores techniques and theoretical bounds on efficiently encodable low-density parity-check (LDPC) codes for correcting single and multiple bursts of erasures and/or errors. The approach is to co...

LDPC Codes For The Classic Bursty Channel

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Burst-Erasure Correcting Codes with Optimal Average Delay

Performance of Low-Density Parity-Check Codes for Burst Erasure Channels

Performance of low-density parity-check (LDPC) codes with maximum likelihood decoding (MLD) for solid burst erasures is discussed. The columns of the paritycheck matrix of LDPC codes are permuted to increase the distance between elements (DBEs) which are defined as a number of symbol positions between elements 1 at each row of the parity-check matrix. The column permutation method can change th...